Interval-Valued Neural Multi-adjoint Logic Programs
نویسندگان
چکیده
The framework of multi-adjoint logic programming has shown to cover a number of approaches to reason under uncertainty, imprecise data or incomplete information. In previous works, we have presented a neural implementation of its fix-point semantics for a signature in which conjunctors are built as an ordinal sum of a finite family of basic conjunctors (Gödel and Lukasiewicz t-norms). Taking into account that a number of approaches to reasoning under uncertainty consider the set of subintervals of the unit interval as the underlying lattice of truth-values, in this paper we pursue an extension of the previous approach in order to accomodate calculation with truth-intervals.
منابع مشابه
A neural implementation of multi-adjoint logic programming
We present a neural net based implementation of propositional [0, 1]-valued multiadjoint logic programming. The implementation needs some preprocessing of the initial program to transform it in a homogeneous program; then, transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network function...
متن کاملDecomposing Ordinal Sums in Neural Multi-adjoint Logic Programs
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part, a neural net based implementation of homogeneous propositional multi-adjoint logic programming on the unit interval has been presented elsewhere, but restricted to the case in which the only connectives involved in ...
متن کاملA Neural Approach to Extended Logic Programs
A neural net based development of multi-adjoint logic programming is presented. Transformation rules carry programs into neural networks, where truth-values of rules relate to output of neurons, truth-values of facts represent input, and network functions are determined by a set of general operators; the output of the net being the values of propositional variables under its minimal model. Some...
متن کاملA Neural Implementation of Multi-Adjoint Logic Programs Via sf-homogenization
A generalization of the homogenization process needed for the neural implementation of multi-adjoint logic programming (a unifying theory to deal with uncertainty, imprecise data or incomplete information) is presented here. The idea is to allow to represent a more general family of adjoint pairs, but maintaining the advantage of the existing implementation recently introduced in [6]. The sound...
متن کاملBiresiduated Multi-Adjoint Logic Programming
Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...
متن کامل